\documentclass[oribibl]{llncs} 

\usepackage{graphicx}
\usepackage{color}
\usepackage{latexsym}
\usepackage{balance}
\usepackage{subfigure}
\usepackage{setspace}  
\usepackage{amssymb}
\usepackage{amsmath} 
\usepackage{tikz} 
\usepackage{pgfplots}
\pgfplotsset{every x tick label/.append style={font=\tiny, yshift=0.5ex}}
\usepackage[justification=centering]{caption}


\input{macros}


% Latex

\begin{document}
	
	\title{A Dual-Index Based Representation for Processing XPath Queries on Very Large XML Documents}
	\author{Wei Hao\textsuperscript{1,2}  \and Kiminori Matsuzaki\textsuperscript{2}  \and Shigeyuki Sato\textsuperscript{2}}
	\institute{Anhui University of Science and Technology\textsuperscript{1} \\
		Taifeng Avenue 168, Huanian, Anhui Province, China\textsuperscript{1}\\
		Kochi University of Technology\textsuperscript{2} \\ 
		185 Miyanokuchi, Tosayamada, Kami, Kochi, Japan, 782--8502\textsuperscript{2}\\
		\email{whao@aust.edu.cn\textsuperscript{1}, \\
			\{matsuzaki.kiminori, sato.shigeyuki\}@kochi-tech.ac.jp\textsuperscript{2} } 
	}
	\maketitle
	
	
	\begin{abstract}
Although XML processing has been intensively studied in recent years, designing
efficient implementations for evaluating XPath queries on XML documents remains
a challenge in case XML documents are very large. In this study, we implemented
a tree-shaped data structure called partial tree that is intrinsically suitable
for large XML document processing with multiple computers. Our implementation
uses two index sets to accelerate the evaluation of structural relationships
among nodes, making it highly efficient for processing very large XML documents
regarding three important classes of XPath queries: backward, order-aware and
predicate-containing queries. Experiment results show that our implementation
outperforms a start-of-the-art XML database BaseX in both absolute loading time
and execution time for the target queries. The absolute execution time over 358
GB of XML data averagely is only seconds by using 32 EC2 instances.\\

\textbf{keyword:} large XML documents, XPath querying, dual-index, data representation, 
parallel computing.
		
	\end{abstract} 
	
	\input{introduction}
	
	\input{related}
	
	\input{partialtree}
	
	\input{representation}
	
	%\input{preliminary}
	
	\input{query}
	
	\input{evaluation}
	
	\input{conclusion} 
	
	%\input{bibli}
	
	% \bibliographystyle{splncs} 
	
	% \bibliography{ref,xpath,distrib,parallel}
	\input{paper_bbl}
	
\end{document}








